Development and Tuning of Irregular Divide-and-Conquer Applications in DAMPVM/DAC

This work presents implementations and tuning experiences with parallel irregular applications developed using the object oriented framework DAMPVM/DAC. It is implemented on top of DAMPVM and provides automatic partitioning of irregular divide-and-conquer (DAC) applications at runtime and dynamic mapping to processors taking into account their speeds and even loads by other user processes. New implementations of parallel applications tuned for shortest execution time are investigated. They include search, recursive Fibonacci, and finding twin prime numbers in parallel. Various DAC parameters were tuned for specific applications including costs of computing vectors/subtrees, maximum partitioning levels etc. Moreover, the overhead of DAMPVM/DAC compared to sequential implementations is shown including previously implemented adaptive quadrature integration and image recognition.